import java.util.*;

public class Test25 {
    public static void main03(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int nums = in.nextInt();
            int[] arr=new int[nums];


            int sum=0;
            int right=nums-1,left=0;
            for(int i=0;i<nums;i++){
                arr[i]=in.nextInt();
                sum+=arr[i];
            }
            Arrays.sort(arr);
            int cur=arr[right];
            sum-= cur;
            while(left < right ){
                if(sum == cur){
                    System.out.println("true");
                    break;
                }else if(sum < cur){
                    System.out.println("false");
                    break;
                }else{
                    cur+=arr[left];
                    sum-=arr[left];
                    left++;
                }
            }
        }
    }









        public static void main02(String[] args) {
            int[][] schedule={{0, 10}, {10, 20}, {20, 30}};
            System.out.println(hostschedule(schedule));
        }
    public static boolean hostschedule (int[][] schedule) {
        int n=schedule.length;
        long per=schedule[0][0];
        boolean b = false ;
        for(int i=0;i<n;i++){
            for(int j=0;j<2;j++){
                long cur=schedule[i][j];
                if(cur < per){
                    b=true;
                    return false;
                }else{
                    per = cur;
                }
            }
        }
        return true;
    }








    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { // 注意 while 处理多个 case
            String s = in.next();
            int min = s.length(), max = 0;
            Map<Character, Integer> hash = new HashMap<>();
            for (char ch : s.toCharArray()) {
                hash.put(ch, hash.getOrDefault(ch, 0) + 1);
            }
            for(Map.Entry<Character, Integer> entry : hash.entrySet()){
                if(entry.getValue() > max){
                    max = entry.getValue();
                }
                if(entry.getValue() < min){
                    min= entry.getValue();
                }
            }
            boolean b = isZhi(max - min);
            if (b) {
                System.out.println("Lucky Word");
                System.out.println(max - min);
            } else {
                System.out.println("No Answer");
                System.out.println("0");
            }
        }
    }

    public static boolean isZhi(int n) {
        if (n == 0) {
            return false;
        } else if (n == 1 || n == 2 || n == 3) {
            return true;
        } else {
            for (int i = 2; i <= Math.sqrt(n); i++) {
                if (n % i == 0 ) {
                    return false;
                }
            }
            return true;
        }
    }


}
